uniform companding

См. также в других словарях:

• Companding — Original signal After compressing, before expanding In …   Wikipedia

• линейное компандирование — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN uniform companding …   Справочник технического переводчика

• нелинейное компандирование — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN non uniform companding …   Справочник технического переводчика

• ГОСТ 22670-77: Сеть связи цифровая интегральная. Термины и определения — Терминология ГОСТ 22670 77: Сеть связи цифровая интегральная. Термины и определения оригинал документа: 10. n ичный сигнал электросвязи n агу digital signal Цифровой сигнал электросвязи, имеющий п возможных состояний представляющего параметра,… …   Словарь-справочник терминов нормативно-технической документации

• Reel-to-reel audio tape recording — Reel to reel redirects here. For the music group, see Reel 2 Real. For other uses, see roll to roll processing. A reel to reel tape recorder (Sony TC 630), typical of those which were once common audiophile objects. Note the distinctive Scotch… …   Wikipedia

• Multiple sub-Nyquist sampling encoding — MUSE (Multiple sub Nyquist sampling encoding), was a dot interlaced digital video compression system that used analog modulation for transmission to deliver 1125 line high definition video signals to the home. Japan had the earliest working HDTV… …   Wikipedia

• Quantization (signal processing) — In digital signal processing, quantization is the process of approximating a continuous range of values (or a very large set of possible discrete values) by a relatively small set of discrete symbols or integer values.More specifically, a signal… …   Wikipedia

• List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

• Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… …   Wikipedia

• Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… …   Wikipedia

• Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia